On a simplified Fourier transform for permutations

This paper derives a simple form for the group representation based Fourier transform of permutations acting on a n-dimensional vector space, and shows that the simplified transform requires less than 2n multiplications and 2n additions. The transform is based on the wellknown Young orthogonal form for constructing irreducible representations of the symmetric group.